Experimenting with Constraint Programming on GPU
نویسندگان
چکیده
منابع مشابه
Experimenting with Heuristics for Answer Set Programming
Answer Set Programming (ASP) is a novel programming paradigm, which allows to solve problems in a simple and highly declarative way. The language of ASP (function-free disjunctive logic programming) is very expressive, and allows to represent even problems of high complexity (every problem in the complexity class P2 = NPNP). As for SAT solvers, the heuristic for the selection of the branching l...
متن کاملpreventive maintenance scheduling with integer programming and constraint programming
preventive maintenance scheduling is to perform a series of tasks that prevents or minimizes production breakdowns and improves the reliability. mathematical models have been developed to solve the preventive maintenance scheduling problem. there are several limitations in the prior work in this area of research. craft combinations are assumed to be given. the craft combination problem concerns...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملExperimenting with X10 for Parallel Constraint-Based Local Search
In this study, we have investigated the adequacy of the PGAS parallel language X10 to implement a Constraint-Based Local Search solver. We decided to code in this language to benefit from the ease of use and architectural independence from parallel resources which it offers. We present the implementation strategy, in search of different sources of parallelism in the context of an implementation...
متن کاملConstraint Programming with Multisets
We propose extending constraint solvers with multiset variables. That is, variables whose values are multisets. Such an extension can help prevent introducing unnecessary symmetry into a model. We identify a number of different representations for multiset variables, and suggest primitive and global constraints on multiset variables. Surprisingly, unlike finite domain variables, decomposition o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2019
ISSN: 2075-2180
DOI: 10.4204/eptcs.306.58